Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
w(r(x)) → r(w(x))
b(r(x)) → r(b(x))
b(w(x)) → w(b(x))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
w(r(x)) → r(w(x))
b(r(x)) → r(b(x))
b(w(x)) → w(b(x))
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:
b1 > w1 > r1
and weight map:
r_1=1
w_1=1
b_1=1
dummyConstant=1